A Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple Matches
نویسندگان
چکیده
In this paper we will present a quantum algorithm which works very efficiently in case of multiple matches within the search space and in the case of few matches, the algorithm performs classically. This allows us to propose a hybrid quantum search engine that integrates Grover’s algorithm and the proposed algorithm here to have general performance better that any pure classical or quantum search algorithm.
منابع مشابه
A New Hybrid Method for Web Pages Ranking in Search Engines
There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...
متن کاملDesigning a hybrid quantum controller for strongly eigenstate controllable systems
In this paper, a new quantum hybrid controller for controlling the strongly eigenstate controllable systems, is designed. For this purpose, a Lyapunov control law is implemented when the target state is in reachable set of the initial state. On the other hand, if the target state is not in the reachable set of the given initial state, based on Grover algorithm, a new interface state that the t...
متن کاملQuantum Search Algorithm with more Reliable Behaviour using Partial Diffusion
In this paper, we will use a quantum operator which performs the inversion about the mean operation only on a subspace of the system (Partial Diffusion Operator) to propose a quantum search algorithm runs in O( √ N/M ) for searching unstructured list of size N with M matches such that, 1 ≤ M ≤ N . We will show that the performance of the algorithm is more reliable than known quantum search algo...
متن کاملQUANTUM VERSION OF TEACHING-LEARNING-BASED OPTIMIZATION ALGORITHM FOR OPTIMAL DESIGN OF CYCLIC SYMMETRIC STRUCTURES SUBJECT TO FREQUENCY CONSTRAINTS
As a novel strategy, Quantum-behaved particles use uncertainty law and a distinct formulation obtained from solving the time-independent Schrodinger differential equation in the delta-potential-well function to update the solution candidates’ positions. In this case, the local attractors as potential solutions between the best solution and the others are introduced to explore the solution space...
متن کاملStrength and Weakness in Grover’s Quantum Search Algorithm
Grover’s quantum search algorithm is considered as one of the milestone in the field of quantum computing. The algorithm can search for a single match in a database with N records in O( √ N) assuming that the item must exist in the database with quadratic speedup over the best known classical algorithm. This review paper discusses the performance of Grover’s algorithm in case of multiple matche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006